Isomorphism conjectures with proper coefficients
نویسندگان
چکیده
منابع مشابه
Inheritance of Isomorphism Conjectures under colimits
We investigate when Isomorphism Conjectures, such as the ones due to Baum-Connes, Bost and Farrell-Jones, are stable under colimits of groups over directed sets (with not necessarily injective structure maps). We show in particular that both the K-theoretic Farrell-Jones Conjecture and the Bost Conjecture with coefficients hold for those groups for which Higson, Lafforgue and Skandalis have dis...
متن کاملPotential isomorphism and semi-proper trees
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the cardinality of the models. We introduce the notion of weakly semiproper trees, and note that there is a strong connection between the existence of potentially ...
متن کاملTwo conjectures on strong embeddings and 2-isomorphism for graphs
We present two conjectures related to strong embeddings of a graph into a surface. The first conjecture relates equivalence of integer quadratic forms given by the Laplacians of graphs, 2-isomorphism of 2connected graphs, and strong embeddings of graphs. We prove various special cases of this conjecture, and give evidence for it. The second conjecture, motivated by ideas from physics and number...
متن کاملInduced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a complete graph the problem is NP-complete, as it is then equivalent to the Clique problem. In a recent paper [10] Marx and Schlotter show that Induced Subgraph Isomorphism is NP-complete when G and H are restricted to b...
متن کاملInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Given two graphs G and H as input, the Induced Subgraph Isomorphism (ISI) problem is to decide whether G has an induced subgraph that is isomorphic to H. This problem is NP-complete already when G and H are restricted to disjoint unions of paths, and consequently also NP-complete on proper interval graphs and on bipartite permutation graphs. We show that ISI can be solved in polynomial time on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2014
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2013.11.016